AXIOMATIZATION OF COMPUTER-ORIENTED MODEL LOGIC AND DECISION PROCEDURE
نویسندگان
چکیده
منابع مشابه
Decision procedure for Default Logic
Using a proof-theoretic approach to non-monotone reasoning we introduce an algorithm to compute all extensions of any (propositional) default theory (D, W ) and we also prove correctness of the method. This algorithm is based on a modified analytic tableaux method.
متن کاملMajority Logic: Axiomatization and Completeness
Graded modal logic, as presented in [5], extends propositional modal systems with a set of modal operators ♦n (n ∈ N) that express “there are more than n accessible worlds such that...”. We extend∗ GML with a modal operator W that can express “there are more than or equal to half of the accessible worlds such that...”. The semantics of W is straightforward provided there are only finitely many ...
متن کاملYet Another Decision Procedure for Equality Logic
We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. We suggest the Reduced Transitivity Constraints (RTC) algorithm, that unlike the spar...
متن کاملDecision Procedure for Temporal Logic of Belief and Actions
A temporal logic of belief and actions (TLBA) is considered. The TLBA allows us to express informational and dynamic properties of computational agents. The considered fragment of TLBA allows one: (1) to present a deduction-based structured decision procedure; (2) to separate a decision procedure for so-called induction-free formulas and (3) to use only logical axioms for such formulas. The mai...
متن کاملA Proof System and a Decision Procedure for Equality Logic
We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conjunctive normal form. Central in our approach is a single proof rule called equality resolution (ER). For this single rule we prove soundness and completeness. Based on this rule we propose a complete procedure for E-SAT and prove its correctness. Applying our procedure on a variation of the pigeon hole for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1985
ISSN: 0286-522X
DOI: 10.5109/13367